A note on permutations and rank aggregation

نویسندگان

Geir Dahl

Harald Minken

چکیده

In this brief note we consider rank aggregation, a popular method in voting theory, social choice, business decisions etc. Mathematically the problem is to find a permutation – viewed as a vector – that minimizes the sum of the `1-distances to a given family of permutations. The problem may be solved as an assignment problem and we establish several properties of optimal solutions in this problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unsupervised Submodular Rank Aggregation on Score-based Permutations

Unsupervised rank aggregation on score-based permutations, which is widely used in many applications, has not been deeply explored yet. This work studies the use of submodular optimization for rank aggregation on score-based permutations in an unsupervised way. Specifically, we propose an unsupervised approach based on the Lovasz Bregman divergence for setting up linear structured convex and ne...

متن کامل

Efficient Rank Aggregation via Lehmer Codes

We propose a novel rank aggregation method based on converting permutations into their corresponding Lehmer codes or other subdiagonal images. Lehmer codes, also known as inversion vectors, are vector representations of permutations in which each coordinate can take values not restricted by the values of other coordinates. This transformation allows for decoupling of the coordinates and for per...

متن کامل

On the hardness of maximum rank aggregation problems

The rank aggregation problem consists in finding a consensus ranking on a set of alternatives, based on the preferences of individual voters. The alternatives are expressed by permutations, whose pairwise distance can be measured in many ways. In this work we study a collection of distances, including the Kendall tau, Spearman footrule, Minkowski, Cayley, Hamming, Ulam, and related edit distanc...

متن کامل

S K and Tensor Representations

Consider the algebra A formed by taking arbitrary linear combinations of the different permutations, considered as operators acting on the space of k’th rank tensors. This algebra can be constructed for any group, particularly finite groups, and is called the group algebra. (this is not the Lie algebra!). Note that this sum of permutations makes sense only as operators on a vector space. It is ...

متن کامل